Continuous-time digital search tree and a border aggregation model
نویسندگان
چکیده
We consider the continuous-time version of random digital search tree, and construct a coupling with border aggregation model as studied in Thacker Volkov (Ann. Appl. Probab. 28 (2018) 1604–1633), showing relation between height tree time required for aggregation. This carries over to corresponding discrete-time models. As consequence we find very precise asymptotic result aggregation, using recent results by Drmota et al. (Random Structures Algorithms 58 (2021) 430–467) tree.
منابع مشابه
A continuous-time search model with job switch and jumps
We study a new search problem in continuous time. In the traditional approach, the basic formulation is to maximize the expected (discounted) return obtained by taking a job, net of search cost incurred until the job is taken. Implicitly assumed in the traditional modeling is that the agent has no job at all during the search period or her decision on a new job is independent of the job situati...
متن کاملTemporal Aggregation and the Continuous-Time Capital Asset Pricing Model
We examine how the empirical implications of the Capital Asset Pricing Model (CAPM) are affected by the length of the period over which returns are measured. We show that the continuous-time CAPM becomes a multifactor model when the asset pricing relation is aggregated temporally. We use Hansen's Generalized Method of Moments (GMM) approach to test the continuous-time CAPM at an unconditional l...
متن کاملState Aggregation in Monte Carlo Tree Search
Monte Carlo tree search (MCTS) algorithms are a popular approach to online decision-making in Markov decision processes (MDPs). These algorithms can, however, perform poorly in MDPs with high stochastic branching factors. In this paper, we study state aggregation as a way of reducing stochastic branching in tree search. Prior work has studied formal properties of MDP state aggregation in the co...
متن کاملA Constant Update Time Finger Search Tree
Levcopolous and Overmars [L088] described a search tree in which the time to insert or delete a key was O( 1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Ko...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2022
ISSN: ['1573-9759', '1350-7265']
DOI: https://doi.org/10.3150/21-bej1429